package map.kruskal;

import java.util.Scanner;

public class Main {
    static class Edge{
        int l;
        int r;
        int val;
        public Edge(int l, int r, int val){
            this.l = l;
            this.r = r;
            this.val = val;
        }
    }
    private static int n = 10001;
    private static int[] father = new int[n];
    public static void init(){
        for (int i = 0; i < n; i++) {
            father[i] = i;
        }
    }
    // 并查集的查找操作
    public static int find(int u) {
        if (u == father[u]) return u;
        return father[u] = find(father[u]);
    }

    // 并查集的加入集合
    public static void join(int u, int v) {
        u = find(u);
        v = find(v);
        if (u == v) return;
        father[v] = u;
    }
    public static void main(String[] args) {
        new Scanner(System.in);
    }
}
